Commutators of Skew-Symmetric Matrices

نویسندگان

  • Anthony M. Bloch
  • Arieh Iserles
چکیده

In this paper we develop a theory for analysing the size of a Lie bracket or commutator in a matrix Lie algebra. Complete details are given for the Lie algebra so(n) of skew symmetric matrices. 1 Norms and commutators in Mn[R] and so(n) This paper is concerned with the following question. Let g be a Lie algebra (Carter, Segal & Macdonald 1995, Humphreys 1978, Varadarajan 1984). Given X,Y ∈ g and a norm ‖ · ‖ : g → R+, what is the size of ‖[X,Y ‖ in comparison with ‖X‖ · ‖Y ‖? On the face of this, this question has little merit since the elementary inequality ‖[X,Y ]‖ ≤ 2‖X‖ · ‖Y ‖ (1.1) always holds for X,Y ∈ Mn[R], the set of all n × n real matrices and an arbitrary norm ‖ · ‖. Moreover, it is easy to prove that the bound (1.1) can be attained for most norms of practical interest. In particular, this is the case for two types of norms closely associated with a remarkable paper of von Neumann (1937). We recall that a symmetric gauge is a vector norm · which is both symmetric and positive. In other words, for every x ∈ R it is true that xπ = x and |x| = x , where π is a permutation of {1, 2, . . . , n}, x> π = [xπ1 , xπ2 , . . . , xπn ] and |x|> = [|x1|, |x2|, . . . , |xn|]. We consider two norms, firstly the operator norm X = max v 6=0 Xv v and secondly the norm ‖X‖ = σ(X) , (1.2) where σ(X) are the singular values of X , arbitrarily ordered. While it is easy to see that (1.2) is a unitary norm (i.e,, invariant under multiplication by a unitary matrix), von Neumann proved that all unitary norms are of this form. Department of Mathematics, University of Michigan, Ann Arbor, MI 48109, USA, email [email protected], supported in part by the National Science Foundation. Department of Applied Mathematics and Theoretical Physics, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA, England, email [email protected]. 1 We consider just the case n = 2, since it can be imbedded in Mn[R] for any n ≥ 2. Let X = [ 1 0 0 −1 ]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The (R,S)-symmetric and (R,S)-skew symmetric solutions of the pair of matrix equations A1XB1 = C1 and A2XB2 = C2

Let $Rin textbf{C}^{mtimes m}$ and $Sin textbf{C}^{ntimes n}$ be nontrivial involution matrices; i.e., $R=R^{-1}neq pm~I$ and $S=S^{-1}neq pm~I$. An $mtimes n$ complex matrix $A$ is said to be an $(R, S)$-symmetric ($(R, S)$-skew symmetric) matrix if $RAS =A$ ($ RAS =-A$). The $(R, S)$-symmetric and $(R, S)$-skew symmetric matrices have a number of special properties and widely used in eng...

متن کامل

Evolutionary Forms: the Generation of Differential-geometrical Structures. (symmetries and Conservation Laws.)

Evolutionary forms, as well as exterior forms, are skew-symmetric differential forms. But in contrast to the exterior forms, the basis of evolutionary forms is deforming manifolds (manifolds with unclosed metric forms). Such forms possess a peculiarity, namely, the closed inexact exterior forms are obtained from that. The closure conditions of inexact exterior form (vanishing the differentials ...

متن کامل

TRIANGULAR FUZZY MATRICES

In this paper, some elementary operations on triangular fuzzynumbers (TFNs) are defined. We also define some operations on triangularfuzzy matrices (TFMs) such as trace and triangular fuzzy determinant(TFD). Using elementary operations, some important properties of TFMs arepresented. The concept of adjoints on TFM is discussed and some of theirproperties are. Some special types of TFMs (e.g. pu...

متن کامل

Unitary Completions Of Complex Symmetric And Skew Symmetric Matrices ∗

Unitary symmetric completions of complex symmetric matrices are obtained via Autonne decomposition. The problem arises from atomic physics. Of independent interest unitary skew symmetric completions of skew symmetric matrices are also obtained by Hua decomposition.

متن کامل

The design and use of a sparse direct solver for skew symmetric matrices

We consider the direct solution of sparse skew symmetric matrices. We see that the pivoting strategies are similar, but simpler, to those used in the factorization of sparse symmetric indefinite matrices, and we briefly describe the algorithms used in a forthcoming direct code based on multifrontal techniques for the factorization of real skew symmetric matrices. We show how this factorization ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • I. J. Bifurcation and Chaos

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2005